уточнение маршрутизации
Общий термин, используемый для уточнения топологии или пути.
[http://www.lexikon.ru/dict/net/index.html]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Constraint-based Routing Label Distribution Protocol — (CR LDP) is a control protocol used in some computer networks. As of February 2003, the IETF MPLS working group deprecated CR LDP and decided to focus purely on RSVP TE. It is an extension of the Label Distribution Protocol (LDP), one of the… … Wikipedia
Constraint graph (layout) — In some tasks of integrated circuit layout design a necessity arises to optimize placement of non overlapping objects in the plane. In general this problem is extremely hard, and to tackle it with computer algorithms, certain assumptions are made … Wikipedia
Constraint Based Routing — Constrained Shortest Path First (CSPF) ist eine Erweiterung für Kürzester Pfad Algorithmen. Der von CSPF berechnete kürzeste Pfad erfüllt zusätzliche Nebenbedingungen. Dies bedeutet, dass der Kürzeste Pfad Algorithmus berechnet wird, nachdem die… … Deutsch Wikipedia
уточнение маршрутизации — Общий термин, используемый для уточнения топологии или пути. [http://www.lexikon.ru/dict/net/index.html] Тематики сети вычислительные EN routing constraint … Справочник технического переводчика
Path computation element — Routing is the process of finding a suitable route for conveying data between a source and one or a set of destination. Routing can be subject to a set of constraints, like QoS, policy, or price. Constraint based path computation is a strategic… … Wikipedia
Design closure — is the process by which a VLSI design is modified from its initial description to meet a growing list of design constraints and objectives. Every step in the IC design (such as static timing analysis, placement, routing, and so on) is already… … Wikipedia
Constrained Shortest Path First — (CSPF) is an extension of shortest path algorithms. The path computed using CSPF is a shortest path fulfilling a set of constraints. It simply means that it runs shortest path algorithm after pruning those links that violate a given set of… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
Adaptive quality of service — Quality of Service (QoS) Routing Protocols have become increasingly poplular and have numerous applications. One application in which it is extremely useful is in Ad Hoc networks. The United States Air Force is determining the best way to employ… … Wikipedia
Multiprotocol Label Switching — MPLS redirects here. For other uses, see Mpls. MPLS Layer Multiprotocol Label Switching (MPLS) is a mechanism in high performance telecommunications networks that directs data from one network node to the next based on short path labels rather… … Wikipedia
